Support Measure Admissibility Based on Operations on Instance Graphs
نویسنده
چکیده
The concept of support is central to data mining. While the definition of support in transaction databases is intuitive and simple, that is not the case in graph datasets and databases. Most mining algorithms require the support of a pattern to be no grater than that of its subpatterns, a property called anti-monotonicity or admissibility. This study examines the requirements for admissibility of a support measure. Support measure for mining graphs are usually based on the notion of an instance graph-a graph representing all the instances of the pattern in a database and their intersection properties. Necessary and sufficient conditions for support measure admissibility, based on operations on instance graphs, are developed and proved. The sufficient conditions are used to prove ad admissibility of one support measure-the size of the independent set in the instance graph. Conversely, the necessary conditions are used to quickly show that some other support measures, such as weighted count of instances, are not admissible.
منابع مشابه
New Results About Sub-Admissibility for General Families on Heuristic Search Algorithms
We propose a formal generalization for various works dealing with Heuristic Search in state graphs. This generalization focuses on the properties of the evaluation functions, on the characteristics of the state graphs, on the notion of path length, on the procedures that control the choices of the node expansions, on the rules that govern the updating operations. Consequently, we present new th...
متن کاملAlgorithms ¤ for L -standard State Graphs : Results About Termination and Admissibility
We formally extend various works dealing with Heuristic Search in state graphs, focusing on 1) the notion of path length, 2) the characteristics of the state graphs, 3) the procedures that control the choices of the states to be expanded, 4) the rules that govern the update operations, 5) the properties of the evaluation functions. We present new general theorems concerning the termination at a...
متن کاملCompleteness and Admissibility for General Heuristic Search Algorithms-A Theoretical Study: Basic Concepts and Proofs
We propose a formal generalization for various works dealing with Heuristic Search in State Graphs. This generalization focuses on the properties of the evaluation functions, on the characteristics of the state graphs, on the notion of path length, on the procedures that control the node expansions, on the rules that govern the update operations. Consequently, we present the algorithm family an...
متن کاملProceedings of the MoDELS’05 Workshop on Tool Support for OCL and Related Formalisms - Needs and Trends
We propose an approach for the integrated description of a metamodel and its formal relationship to its models and the model instantiations. The central idea is to use so-called layered graphs permitting to describe type graphs and instance graphs. A type graph can describe a collection of types and their relationships whereas an instance graph can represent instances belonging to the types and...
متن کاملWeak Integer Additive Set-Indexers of Certain Graph Products
An integer additive set-indexer is defined as an injective function f : V (G) → 2N0 such that the induced function gf : E(G) → 2N0 defined by gf (uv) = f(u) + f(v) is also injective, where f(u) + f(v) is the sumset of f(u) and f(v). If gf (uv) = k ∀ uv ∈ E(G), then f is said to be a k-uniform integer additive set-indexers. An integer additive set-indexer f is said to be a weak integer additive ...
متن کامل